Longest Fragment First Algorithms for Data Compression
نویسنده
چکیده
On{line text{compression algorithms are considered, where compression is done by substituting substrings of the text according to some xed dictionary (code book). Due to the long running time of optimal compression algorithms, several on{line heuristics have been introduced in the literature. In this paper we analyse two modied version of an old algorithm introduced by Shuegraf and Heaps [8]. We will investigate the worst case behaviour of this Longest Fragment First (LFF) algorithm for several types of special dictionaries.
منابع مشابه
Linear-Time Text Compression by Longest-First Substitution
We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm for LFS. Our algorithm employs a new data structure called sparse lazy suffix trees. We also deal with a more sophisticated version of LFS, called ...
متن کاملParallel Parsing Algorithms for Static Dictionary Compression
ÐThe data compression based on dictionary techniques works by replacing phrases in the input string with indexes into some dictionary. The dictionary can be static or dynamic. In static dictionary compression, the dictionary contains a predetermined fixed set of entries. In dynamic dictionary compression, the dictionary changes its entries during compression. We present parallel algorithms for ...
متن کاملDictionary Compression on the PRAM
Parallel algorithms for lossless data compression via dictionary compression using optimal, longest fragment rst (LFF), and greedy parsing strategies are described. Dictionary compression removes redundancy by replacing substrings of the input by references to strings stored in a dictionary. Given a static dictionary stored as a su x tree, we present a CREW PRAM algorithm for optimal compressio...
متن کاملLongest - match String Searching for Ziv – Lempel Compression timothy
SUMMARY Ziv–Lempel coding is currently one of the more practical data compression schemes. It operates by replacing a substring of a text with a pointer to its longest previous occurrence in the input, for each coding step. Decoding a compressed file is very fast, but encoding involves searching at each coding step to find the longest match for the next few characters. This paper presents eight...
متن کاملLongest-match String Searching for Ziv-Lempel Compression
Ziv-Lempel coding is currently one of the more practical data compression schemes. It operates by replacing a substring of a text with a pointer to its longest previous occurrence in the input, for each coding step. Decoding a compressed le is very fast, but encoding involves searching at each coding step to nd the longest match for the next few characters. This paper presents eight data struct...
متن کامل